A Comparison among Bidding Algorithms for Multiple Auctions
نویسنده
چکیده
We study simulations of populations of agents participating in sequences of overlapping English auctions, using three different bidding algorithms. We measure various parameters of the agents’ success, to determine qualities of the underlying bidding algorithms. In particular, we show that a Dynamic Programming approach, in which beliefs regarding the opposition the agent is likely to face are built up on-the-fly, is robust enough with respect to the inaccuracy of its beliefs to outperform a greedy approach right from the moment they both start playing.
منابع مشابه
The Timing of Bid Placement and Extent of Multiple Bidding: An Empirical Investigation Using eBay Online Auctions
Online auctions are fast gaining popularity in today’s electronic commerce. Relative to offline auctions, there is a greater degree of multiple bidding and late bidding in online auctions, an empirical finding by some recent research. These two behaviors (multiple bidding and late bidding) are of “strategic” importance to online auctions and hence important to investigate. In this article we em...
متن کاملBackward induction strategy (BIDS) for bidding in multiple auctions
We present a bidding strategy that enables an agent to bid in multiple English auctions. Based on a backward induction method, this Backward InDuction Strategy (BIDS) seeks to maximize the value of a utility function. In general, the agent needs to determine whether to bid in the next available auction. Note that it may be better to stop bidding if the current utility (the utility associated wi...
متن کاملUsing and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators
With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...
متن کاملA First Approach to Autonomous Bidding in Ad Auctions
We present autonomous bidding strategies for ad auctions, first for a stylized problem, and then for the more realistic Trading Agent Competition for Ad Auctions (TAC AA)—a simulated market environment that tries to capture some of the complex dynamics of bidding in ad auctions. We decompose the agent’s problem into a modeling subproblem, where we estimate values such as click probability and c...
متن کاملAn Optimization Framework for Combining the Petroleum Replenishment Problem with the Optimal Bidding in Combinatorial Auctions
We address in this paper a periodic petroleum station replenishment problem (PPSRP) that aims to plan the delivery of petroleum products to a set of geographically dispatched stations. It is assumed that each station is characterized by its weekly demand and by its frequency of service. The main objective of the delivery process is to minimize the total travelled distance by the vailable trucks...
متن کامل